Hypermethylated-capped selenoprotein mRNAs in mammals.

Mammalian mRNAs are generated by complex and coordinated biogenesis pathways and acquire 5'-end m7G caps that play fundamental roles in processing and translation. Here we show that several selenoprotein mRNAs are not recognized efficiently by translation initiation factor eIF4E because they bear a hypermethylated cap. This cap modification is acquired via a 5'-end maturation pathway similar to that of the small nucle(ol)ar RNAs (sn- and snoRNAs). Our findings also establish that the trimethylguanosine synthase 1 (Tgs1) interacts with selenoprotein mRNAs for cap hypermethylation and that assembly chaperones and core proteins devoted to sn- and snoRNP maturation contribute to recruiting Tgs1 to selenoprotein mRNPs. We further demonstrate that the hypermethylated-capped selenoprotein mRNAs localize to the cytoplasm, are associated with polysomes and thus translated. Moreover, we found that the activity of Tgs1, but not of eIF4E, is required for the synthesis of the GPx1 selenoprotein in vivo

Improved Quantum Lower and Upper Bounds for Matrix Scaling

Matrix scaling is a simple to state, yet widely applicable linear-algebraic problem: the goal is to scale the rows and columns of a given non-negative matrix such that the rescaled matrix has prescribed row and column sums. Motivated by recent results on first-order quantum algorithms for matrix scaling, we investigate the possibilities for quantum speedups for classical second-order algorithms, which comprise the state-of-the-art in the classical setting. We first show that there can be essentially no quantum speedup in terms of the input size in the high-precision regime: any quantum algorithm that solves the matrix scaling problem for n × n matrices with at most m non-zero entries and with ₂-error ε = Θ~(1/m) must make Ω(m) queries to the matrix, even when the success probability is exponentially small in n. Additionally, we show that for ε ∈ [1/n,1/2], any quantum algorithm capable of producing ε/100-₁-approximations of the row-sum vector of a (dense) normalized matrix uses Ω(n/ε) queries, and that there exists a constant ε₀ > 0 for which this problem takes Ω(n^{1.5}) queries. To complement these results we give improved quantum algorithms in the low-precision regime: with quantum graph sparsification and amplitude estimation, a box-constrained Newton method can be sped up in the large-ε regime, and outperforms previous quantum algorithms. For entrywise-positive matrices, we find an ε-₁-scaling in time O~(n^{1.5}/ε²), whereas the best previously known bounds were O~(n²polylog(1/ε)) (classical) and O~(n^{1.5}/ε³) (quantum)

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes

We consider a fundamental integer programming (IP) model for cost–benefit analysis and flood protection through dike building in the Netherlands, due to Zwaneveld and Verweij (2017). Experimental analysis with data for the IJsselmeer shows that the solution of the linear programming relaxation of the IP model is integral. This naturally leads to question whether the polytope associated to the IP is always integral. In this paper we first give a negative answer to this question by proving the non-integrality of the polytope. Secondly, we establish natural conditions that guarantee the linear programming relaxation of the IP model is integral. We show that these conditions are indeed satisfied by the recent data on flood probabilities, damage and investment costs of IJsselmeer. Finally, we show that the IP model can be solved in polynomial time when the number of dike segments, or the number of feasible barrier heights, are bounded

Selective modulation of the expression of L-selectin ligands by an immune response

BACKGROUND: The adhesion molecule L-selectin is expressed on the cell surface of lymphocytes and mediates their migration from the bloodstream into lymph nodes. L-selectin is able to recognize four glycoprotein ligands, three of which--Sgp50, Sgp90, and Sgp200--are sulphated, bind specifically to L-selectin and are synthesized by the high endothelial venules of the peripheral and mesenteric lymph nodes. One of these three sulphated L-selectin ligands, Sgp90, has been shown to be identical to the known surface marker CD34 and is expressed on the cell surface of endothelial cells. The cDNA encoding Sgp50 has been cloned, and its product, which has been designated GlyCAM-1, is secreted. The third ligand, Sgp200, is both secreted and cell-associated. We have investigated how the expression of these sulphated glycoproteins is regulated during an immune response. RESULTS: Here we demonstrated that, during a primary immune response, the expression and secretion of both GlyCAM-1 and Sgp200 are reduced, recovering to normal levels 7-10 days after antigen stimulation. In contrast, the expression of cell-associated CD34 and Sgp200 is relatively unaffected. These results may account for the modest decreases in the binding of an L-selectin-IgG fusion protein to high endothelial venules of inflamed peripheral lymph nodes that have been observed after antigen exposure. In vivo experiments show that, following the decrease in the levels of secreted GlyCAM-1 and Sgp200, migration of lymphocytes from the blood stream into lymph nodes remains L-selectin-dependent, but more lymphocytes home to antigen-primed than unprimed peripheral lymph nodes. CONCLUSIONS: We suggest that the secreted forms of the L-selectin ligands GlyCAM-1 and Sgp200 act as modulators of cell adhesion, and that cell-associated CD34 and Sgp200 are the ligands that mediate the initial loose binding of lymphocytes to high endothelial venules

jurnalekonomi dan bisnis

vol 8 no 16 tahun 201

Building networks to work: an ethnographic study of informal routes into the UK construction industry and pathways for migrant up-skilling

The UK construction industry labour market is characterised by high levels of self-employment, sub-contracting, informality and flexibility. A corollary of this, and a sign of the increasing globalisation of construction, has been an increasing reliance on migrant labour, particularly that from the Eastern European Accession states. Yet, little is known about how their experiences within and outside of work shape their work in the construction sector. In this context better qualitative understandings of the social and communication networks through which migrant workers gain employment, create routes through the sector and develop their role/career are needed. We draw on two examples from a short-term ethnographic study of migrant construction worker employment experiences and practices in the town of Crewe in Cheshire, UK, to demonstrate how informal networks intersect with formal elements of the sector to facilitate both recruitment and up-skilling. Such research knowledge, we argue, offers new evidence of the importance of attending to migrant worker’s own experiences in the development of more transparent recruitment processes